/**
 * 11111111111111111
 * 回文数
 * 111
 */
var isPalindrome = function (x) {
    if (x < 0) return false;
    let oringinN = x;
    let newN = 0;
    while (x > 0) {
        let tmp = x % 10;
        newN = newN * 10 + tmp;
        x = (x - tmp) / 10;
    }
    return oringinN === newN;
};
/**
 * 2222222222222222
 * @param {斐波那契数列*} n
 */
function Fibonacci(n) {
    if (n === 0) {
        return 0;
    }
    if (n === 1) {
        return 1;
    }
    let a = 0,
        b = 1;
    for (let i = 2; i < n; ++i) {
        let c = a + b;
        a = b;
        b = c;
    }
    return a + b;
}
